Graph partitioning models for parallel computing
نویسندگان
چکیده
منابع مشابه
Graph partitioning models for parallel computing
Calculations can naturally be described as graphs in which vertices represent computation and edges reeect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives...
متن کاملGraph partitioning models for parallel computing q
Calculations can naturally be described as graphs in which vertices represent computation and edges re ̄ect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives...
متن کاملRemapping Models for Scientific Computing via Graph and Hypergraph Partitioning
There are numerous parallel scientific computing applications in which the same computation is successively repeated over a problem instance for many times with different parameters. In most of these applications, although the initial task-to-processor mapping may be satisfactory in terms of both computational load balance and communication requirements, the quality of this initial mapping typi...
متن کاملParallel Multilevel Graph Partitioning
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 p...
متن کاملParallel Incremental Graph Partitioning
Partitioning graphs into equally large groups of nodes while minimizing the number of edges between di erent groups is an extremely important problem in parallel computing. For instance, e ciently parallelizing several scienti c and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while commun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2000
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(00)00048-x